منابع مشابه
Comparative analysis of asynchronous cellular automata in stochastic pharmaceutical modelling
In pharmaceutical modelling, cellular automata have been used as an established tool to represent molecular changes through discrete structural interactions. The data quality provided by such modelling is found suitable for the early drug design phase where flexibility is paramount. While both synchronous (CA) and asynchronous (ACA) types of automata have been used, analysis of their nature and...
متن کاملDeterminizing Asynchronous Automata on Infinite Inputs
Asynchronous automata are a natural distributed machine model for recognizing trace languages—languages defined over an alphabet equipped with an independence relation. To handle infinite traces, Gastin and Petit introduced Büchi asynchronous automata, which accept precisely the class of ω-regular trace languages. Like their sequential counterparts, these automata need to be non-deterministic i...
متن کاملOn the Control of Asynchronous Automata
The decidability of the distributed version of the Ramadge and Wonham controller synthesis problem [12], where both the plant and the controllers are modelled as Zielonka automata [13,1] and the controllers have causal memory is a challenging open problem [8,9]. There exists three classes of plants for which the existence of a correct controller with causal memory has been shown decidable: when...
متن کاملImplementing Realistic Asynchronous Automata
Zielonka’s theorem, established 25 years ago, states that any regular language closed under commutation is the language of an asynchronous automaton (a tuple of automata, one per process, exchanging information when performing common actions). Since then, constructing asynchronous automata has been simplified and improved [6, 20, 7, 12, 8, 4, 2, 21, 22]. We first survey these constructions and ...
متن کاملOn the Expressiveness of Asynchronous Cellular Automata
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the existential fragment of monadic second-order logic. In doing so, we provide a framework that unifies many approaches to modeling distributed systems such as the models of asynchronous trace automata and communicating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1970
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(70)90458-4